import java.util.Scanner;

public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode root = binaryTree.creatTree();

        binaryTree.preOrder(root);
        System.out.println();
        binaryTree.inOrder(root);
        System.out.println();
        binaryTree.postOrder(root);
        System.out.println();

        System.out.println("节点的个数：" + binaryTree.nodeSize(root));

        binaryTree.leafSize(root);
        System.out.println("叶子结点个数:" + binaryTree.leafSize);
        System.out.println("树的高度:" + binaryTree.getHeight(root));

        binaryTree.invertTree(root);
        System.out.println("↓");
        binaryTree.levelOrder1(root);
        System.out.println("-=-=-");
        binaryTree.preOrder(root);
        System.out.println();
        binaryTree.preOrderNor(root);
        System.out.println();

        binaryTree.inOrder(root);
        System.out.println();
        binaryTree.inOrderNor(root);
        System.out.println();

        binaryTree.postOrder(root);
        System.out.println();
        binaryTree.postOrderNor(root);


       /* binaryTree.preOrder(root);
        System.out.println(binaryTree.isSymmetric(root));
*/
    }
}





